Task Parallel Implementation of the Bowyer -

In this paper we present a parallel implementation of the Bowyer-Watson (BW) algorithm using the task-parallel programming model. The BW algorithm constitutes an ideal mesh reenement strategy for implementing a large class of unstruc-tured mesh generation techniques on both sequential and parallel computers, by preventing the need for global mesh reenement. Its implementation on distributed memory multicomputes using the traditional data-parallel model has been proven very ineecient due to excessive synchronization needed among processors. In this paper we demonstrate that with the task-parallel model we can tolerate synchronization costs inherent to data-parallel methods by exploring concurrency in the processor level. Our preliminary performance data indicate that the task-parallel approach: (i) is almost four times faster than the existing data-parallel methods, (ii) scales linearly, and (iii) introduces minimum overheads compared to the \best" sequential implementation of the BW algorithm.